Computational complexity of formal translations
نویسندگان
چکیده
منابع مشابه
Formal Translations and Szilard Languages
One of the m e thods for def ining t ranslat ions is the so called syntax-di rec ted t rans la t ion scheme which can be in terpre ted as a pair of ra ther s imilar g rammars wi th the product ions work ing in parallel. Because of the s imilar i ty of the g r a m m a r s each of the two g rammars "f i ts" the other in the sense tha t for each der ivat ion process in one g r a m m a r leading to...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملFormal Reasoning about Software Object Translations
In this work we examine the problem of verifying translations from outputs of one system to the inputs of another system, which we refer to as the output-to-input translation problem. We present a formalization of this problem along with a verification mechanism based on constraint logic programming. Composition of systems is an important issue in the software reuse domain, and has applicabilit...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولComputational Complexity
Complex systems (CS) involve many elements that interact at different scales in time and space. The challenges in modeling CS led to the development of novel computational tools with applications in a wide range of scientific areas. The computational problems posed by CS exhibit intrinsic difficulties that are a major concern in Computational Complexity Theory. This Special Issue (SI) focused o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Systems Theory
سال: 1974
ISSN: 0025-5661,1433-0490
DOI: 10.1007/bf01762186